Acyclic k-connected subgraphs for distributed alternate routing in communications networks
نویسندگان
چکیده
منابع مشابه
Finding Connected Dense k -Subgraphs
Given a connected graph G on n vertices and a positive integer k ≤ n, a subgraph of G on k vertices is called a k-subgraph in G. We design combinatorial approximation algorithms for finding a connected ksubgraph in G such that its density is at least a factor Ω(max{n, k/n}) of the density of the densest k-subgraph in G (which is not necessarily connected). These particularly provide the first n...
متن کاملNode-Optimal Connected k-Subgraphs
In this paper we consider the problem of optimally selecting a set of k nodes in a node-weighted graph, under the requirement that the subgraph induced by the set of nodes selected is connected. This problem arises in a Norwegian oo-shore oil-drilling application. We show this problem to be NP-complete on general graphs, but provide a polynomial time algorithm to nd an optimal solution for tree...
متن کاملGenerating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs
We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs, where k is part of the input, can be done in incremental polynomial time. These results are based on properties of minimally k-connected graphs which might be of independent interest.
متن کاملAn almost O(log k)-approximation for k-connected subgraphs
We consider two cases of the Survivable Network Design (SND) problem: given a complete graph Gn = (V,En) with costs on the edges and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum cost subgraph G of Gn that contains r(u, v) internally disjoint uv-paths for all u, v ∈ V . Our main result is an O (
متن کاملSubgraphs decomposable into two trees and k-edge-connected subgraphs
Given a complete graph with edge weights that satisfy the triangle inequality, we bound the minimum cost of a subgraph which is the union of two spanning trees in terms of the minimum cost of a k-edge-connected subgraph, for k ≤ 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90092-3